Modified Iterative Runge-Kutta-Type Methods for Nonlinear Ill-Posed Problems
نویسندگان
چکیده
منابع مشابه
Iterative methods for nonlinear ill-posed problems in Banach spaces
In this paper, we study convergence of two different iterative regularization methods for nonlinear ill-posed problems in Banach spaces. One of them is a Landweber type iteration, the other one the iteratively regularized Gauss– Newton method with an a posteriori chosen regularization parameter in each step. We show that a discrepancy principle as a stopping rule renders these iteration schemes...
متن کاملNonlinear regularization methods for ill-posed problems
In this paper we consider nonlinear ill-posed problems with piecewise constant or strongly varying solutions. A class of nonlinear regularization methods is proposed, in which smooth approximations to the Heavyside function are used to reparameterize functions in the solution space by an auxiliary function of levelset type. The analysis of the resulting regularization methods is carried out in ...
متن کاملNew Adaptive Exponential Propagation Iterative Methods of Runge-Kutta Type
Exponential integrators have emerged as an efficient alternative to commonly used time-integrators. Recently a new class of exponential propagation iterative methods of Runge-Kutta type (EPIRK) has been introduced [30]. These schemes possess a structure that makes them computationally advantageous compared to other exponential methods. In addition, the general EPIRK formulation offers flexibili...
متن کاملIterative Solution Methods for Large Linear Discrete Ill-posed Problems
This paper discusses iterative methods for the solution of very large severely ill-conditioned linear systems of equations that arise from the discretization of linear ill-posed problems. The right-hand side vector represents the given data and is assumed to be contaminated by errors. Solution methods proposed in the literature employ some form of ltering to reduce the in uence of the error in ...
متن کاملChoosing Regularization Parameters in Iterative Methods for Ill-Posed Problems
Numerical solution of ill-posed problems is often accomplished by discretization (projection onto a finite dimensional subspace) followed by regularization. If the discrete problem has high dimension, though, typically we compute an approximate solution by projecting the discrete problem onto an even smaller dimensional space, via iterative methods based on Krylov subspaces. In this work we pre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Functional Analysis and Optimization
سال: 2016
ISSN: 0163-0563,1532-2467
DOI: 10.1080/01630563.2016.1219744